A Partial Order View of Message-Passing Communication Models
نویسندگان
چکیده
There is a wide variety of message-passing communication models, ranging from synchronous "rendez-vous" communications to fully asynchronous/out-of-order communications. For large-scale distributed systems, the model determined by transport layer network, and few classes orders message delivery (FIFO, causally ordered) have been identified in early days computing. local-scale applications, e.g., running on single machine, may be actual implementation buffers how FIFO queues are used. While such as causal ordering, defined logical axioms, models often an operational semantics. In this work, we connect these two approaches, present unified hierarchy encompassing both based their concurrent behaviors. We also show that all consider can axiomatized monadic second order logic, therefore benefit several bounded verification techniques special treewidth.
منابع مشابه
Synonyms Parallel Communication Models Message-passing Performance Models
Bandwidth-latency models are a group of performance models for parallel programs that focus on modeling the communication between the processes in terms of network bandwidth and latency, allowing quite precise performance estimations. While originally developed for distributed-memory architectures, these models also apply to machines with non-uniform memory access (NUMA), like the modern multi-...
متن کاملImproved Dynamic Partial-Order Reduction for Asynchronous Message-Passing Programs
This paper presents two algorithmic refinements that improve systematic testing of asynchronous message-passing programs for a fixed input. Such programs can have a large number of possible execution paths due to the nondeterministic interleaving of messages. However, many paths are equivalent, and dynamic partial-order reduction (DPOR) techniques attempt to explore all distinct, feasible behav...
متن کاملConvergent message passing algorithms - a unifying view
Message-passing algorithms have emerged as powerful techniques for approximate inference in graphical models. When these algorithms converge, they can be shown to find local (or sometimes even global) optima of variational formulations to the inference problem. But many of the most popular algorithms are not guaranteed to converge. This has lead to recent interest in convergent message-passing ...
متن کاملMessage Passing with Communication Structures
Abstraction concepts based on process groups have largely dominated the design and implementation of communication patterns in message passing systems. Although such an approach seems pragmatic—given that participating processes form a ‘group’—in this dissertation, we discuss subtle issues that affect the qualitative and quantitative aspects of this approach. To address these issues, we introdu...
متن کاملPARSE: simulation of message passing communication networks
The number of design decisions for communication network hardware in message passing distributedmemory systems is quite large, as illustrated by many different implemented and proposed designs. Many of the decisions are driven by, on one side, performance requirements of targeted applications for the parallel system, and on the other side, hardware implementation costs. To obtain cost effective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on programming languages
سال: 2023
ISSN: ['2475-1421']
DOI: https://doi.org/10.1145/3571248